Counting the Number of Solutions to Certain Infinite Diophantine Equations
نویسندگان
چکیده
Let $r$, $v$, $n$ be positive integers. This paper investigate the number of solutions $s_{r,v}(n)$ following infinite Diophantine equations \[ n = 1^{r} \cdot |k_{1}|^{v} + 2^{r} |k_{2}|^{v} 3^{r} |k_{3}|^{v} \cdots \] for $\boldsymbol{k} (k_1,k_2,k_3,\ldots) \in \mathbb{Z}^{\infty}$. For each $(r,v) \mathbb{N} \times \{1,2\}$, a generating function and some asymptotic formulas are established.
منابع مشابه
The Number of Solutions of Diophantine Equations
0. Introduction. In two recent papers 4], 30], Erdd os, Stewart and the author showed that certain diophantine equations have many solutions. In this way they indicated how far certain results are capable for improvements at most. First we mention some relevant results from the literature on upper bounds for the numbers of solutions of diophantine equations and then we sketch how our method lea...
متن کاملOn the exact number of solutions of certain linearized equations
In this note we have revisited some of of the results of Trachtenberg [9], which are directly related with the number of solutions of some special linearized polynomials over finite fields. In some cases we give improvements. Also, we give some results on the exact number of solutions of certain linearized equations depending on the coefficients of that equation.
متن کاملOn the Solutions of Quadratic Diophantine Equations
We determine a finite set of representatives of the set of local solutions in a maximal lattice modulo the stabilizer of the lattice in question for a quadratic Diophantine equation. Our study is based on the works of Shimura on quadratic forms, especially [AQC] and [IQD]. Indeed, as an application of the result, we present a criterion (in both global and local cases) of the maximality of the l...
متن کاملA New Method for Certain Diophantine Equations
1. Introduction. The original purpose of the research described in this article was to obtain results about Diophantine problems on rational surfaces — that is, surfaces defined over a field k which are birationally equivalent to P 2 over the algebraic closure ¯ k. (Throughout this article, K and k will always denote algebraic number fields, with respective rings of integers O and o. Except in ...
متن کاملNew Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
The linear reachability problem is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using results on minimal solutions (in nonnegative integers) for linear Diophantine systems, we obtain new complexity results for the problem, as well as for other linear counting problems of finit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2021
ISSN: ['1027-5487', '2224-6851']
DOI: https://doi.org/10.11650/tjm/201107